MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster than in O(2) Time
نویسندگان
چکیده
We give an exact deterministic algorithm for MAX-SAT. On input CNF formulas with constant clause density (the ratio of the number of clauses to the number of variables is a constant), this algorithm runs in O(c) time where c < 2 and n is the number of variables. Worst-case upper bounds for MAX-SAT less than O(2) were previously known only for k-CNF formulas and for CNF formulas with small clause density.
منابع مشابه
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time
We give an exact deterministic algorithm for MAX-SAT. On input CNF formulas with constant clause density (the ratio of the number of clauses to the number of variables is a constant), this algorithm runs in O(c) time where c < 2 and n is the number of variables. Worst-case upper bounds for MAX-SAT less than O(2) were previously known only for k-CNF formulas and for CNF formulas with small claus...
متن کاملNew Bounds for MAX-SAT by Clause Learning
In this paper we present relatively simple proofs of the following new upper bounds. • c , where c < 2 is a constant, N is the number of variables, for MAX-SAT for formulas with constant clause density; • 2, where K is the number of clauses, for MAX-2-SAT; • 2 for (n, 3)-MAX-2-SAT. All bounds are proved by the splitting method. The main two techniques are combined complexity measures and clause...
متن کاملNatural Max-SAT Encoding of Min-SAT
We show that there exists a natural encoding which transforms Min-SAT instances into Max-SAT instances. Unlike previous encodings, this natural encoding keeps the same variables, and the optimal assignment for the Min-SAT instance is identical to the optimal assignment of the corresponding Max-SAT instance. In addition to that the encoding can be generalized to the Min-SAT variants with clause ...
متن کاملExact Algorithms for MAX-SAT
The maximum satisfiability problem (MAX-SAT) is stated as follows: Given a boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Niedermeier in a recent survey paper asks: Can MAX-SAT be solved in less than 2n “steps”? Here, n is ...
متن کاملComputational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas
Zusammenfassung Abstract The Boolean conjunctive normal form (CNF) satisfiability problem, called SAT for short, gets as input a CNF formula and has to decide whether this formula admits a satisfying truth assignment. As is well known, the remarkable result by S. Cook in 1971 established SAT as the first and genuine complete problem for the complexity class NP [15]. Thus SAT resides at the hear...
متن کامل